Planning with SAT, Admissible Heuristics and A*
نویسنده
چکیده
We study the relationship between optimal planning algorithms, in the form of (iterative deepening) A∗ with (forward) state-space search, and the reduction of the problem to SAT. Our results establish a strict dominance relation between the two approaches: any iterative deepening A∗ search can be efficiently simulated in the SAT framework, assuming that the heuristic has been encoded in the SAT problem, but the opposite is not possible as A∗ and IDA∗ searches sometimes take exponentially longer.
منابع مشابه
Logical Encodings With No Time Indexes for Defining and Computing Admissible Heuristics for Planning
A limitation of the SAT approach to planning and the more recent Weighted-SAT approach to planning with preferences is the use of logical encodings where every fluent and action must be tagged with a time index. The result is that the complexity of the encodings grows exponentially with the planning horizon, and for metrics other than makespan, the optimality achieved is conditional on the plan...
متن کاملImproving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA
Admissible heuristics are essential for optimal planning in the context of search algorithms like A*, and they can also be used in the context of suboptimal planning in order to find quality-bounded solutions. In satisfacing planning, on the other hand, admissible heuristics are not exploited by the best-first search algorithms of existing planners even when a time window is available for impro...
متن کاملCost-Optimal Planning using Weighted MaxSAT
We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automated reasoning for that setting, we develop an approach that operates by solving a sequence of partial weighted MaxSAT problems, each of which corresponds to a step-bounded variant of the problem at hand. Our approach is the first...
متن کاملAutomated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problem such as satisfiability testing (SAT) is a challenging task. We investigate an evolutionary approach to automating the discovery of new local search heuristics for SAT. We show that several well-known SAT local search algorithms such as Walksat and Novelty are composite heuristics that are derived...
متن کاملNew Admissible Heuristics for Domain-Independent Planning
Admissible heuristics are critical for effective domainindependent planning when optimal solutions must be guaranteed. Two useful heuristics are the h heuristics, which generalize the reachability heuristic underlying the planning graph, and pattern database heuristics. These heuristics, however, have serious limitations: reachability heuristics capture only the cost of critical paths in a rela...
متن کامل